Dynamic and Multidimensional Dataflow Graphs

نویسندگان

  • Shuvra S. Bhattacharyya
  • Ed F. Deprettere
  • Joachim Keinert
چکیده

Much of the work to date on data ow models for signal processing system design has focused decidable data ow models that are best suited for onedimensional signal processing. In this chapter, we review more general data ow modeling techniques that are targeted to applications that include multidimensional signal processing and dynamic data ow behavior. As data ow techniques are applied to signal processing systems that are more complex, and demand increasing degrees of agility and exibility, these classes of more general data ow models are of correspondingly increasing interest. We begin with a discussion of two data ow modeling techniques — multi-dimensional synchronous data ow and windowed data ow — that are targeted towards multidimensional signal processing applications. We then provide a motivation for dynamic data ow models of computation, and review a number of speci c methods that have emerged in this class of models. Our coverage of dynamic data ow models in this chapter includes Boolean data ow, the stream-based function model, CAL, parameterized data ow, and enable-invoke data ow. 1 Multidimensional synchronous data owgraphs (MDSDF) In many signal processing applications, the tokens in a stream of tokens have a dimension higher than one. For example, the tokens in a video stream represent images so that a video application is actually three-dimensional. Static multidimensional Shuvra S. Bhattacharyya University of Maryland, USA e-mail: [email protected] Ed F. Deprettere Leiden University, The Netherlands e-mail: [email protected] Joachim Keinert Fraunhofer Institute for Integrated Circuits, Germany e-mail: joachim.keinert@iis. fraunhofer.de 899 In S. S. Bhattacharyya, E. F. Deprettere, R. Leupers, and J. Takala, editors, Handbook of Signal Processing Systems, pages 899-930. Springer, 2010. 900 Shuvra S. Bhattacharyya, Ed F. Deprettere, and Joachim Keinert (MD) streaming applications can be modeled using unidimensional data ow graphs (see Chapter 30), but these are at best cyclo-static data ow graphs, often with many phases in the actor’s vector valued token production and consumption patterns. These models incur a high control overhead that can be avoided when the application is modeled in terms of a multidimensional data ow graph that may turn out to be just a multidimensional version of the unidimensional synchronous data ow graph. Such graphs are called multidimensional synchronous data ow graphs (MDSDF).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multidimensional synchronous dataflow

Signal flow graphs with dataflow semantics have been used in signal processing system simulation, algorithm development, and real-time system design. Dataflow semantics implicitly expose function parallelism by imposing only a partial ordering constraint on the execution of functions. One particular form of dataflow, synchronous dataflow (SDF) has been quite popular in programming environments ...

متن کامل

Almost Continuous Transformations of Software and Higher-order Dataflow Programming

We consider two classes of stream-based computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. The dataflow architecture is a natural platform for programming with streams. The presence of linear combinations allows us to introduce the notion of almost continuous transformation of dataflow graphs. We introduce a new approach to h...

متن کامل

A Framework for Computing on Large Dynamic Graphs

This proposal presents a graph computing framework intending to support both online and offline computing on large dynamic graphs efficiently. The framework proposes a new data model to support rich evolving vertex and edge data types. It employs a replica-coherence protocol to improve data locality thus can adapt to data access patterns of different algorithms. A new computing model called pro...

متن کامل

Semi-Static Dataflow

In this paper we present a new dataflow execution model called semi-static dataflow. This model incorporates aspects of conventional static and dynamic dataflow architectures. Programs are partitioned into a collection of dataflow graphs. The execution of each of these graphs is the responsibility of a low-level process called a context. The static dataflow execution model is used to evaluate e...

متن کامل

Aggregated Dynamic Dataflow Graph Generation and Visualization

Aggregated Dynamic Dataflow Graphs can assist programmers to uncover the main data paths of a given algorithm. This information can be useful when scaling a singlethreaded program into a multi-core architecture. The amount of data movements is crucial when targeting for cache incoherent and/or heterogeneous platforms. This paper presents two methods for generating function-level Aggregated Dyna...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010